Cohn and Umans proposed a framework for developing fast matrix multiplication algorithms based on the embedding computation in certain groups algebras. In subsequent work with Kleinberg and Szegedy, they connected this to the search for combinatorial objects called strong uniquely solvable puzzles (strong USPs). We begin a systematic computer-aided search for these objects. We develop and implement constraint-based algorithms build on reductions to $\mathrm{SAT}$ and $\mathrm{IP}$ to verify that puzzles are strong USPs, and to search for large strong USPs. We produce tight bounds on the maximum size of a strong USP for width $k \le 5$, construct puzzles of small width that are larger than previous work, and improve the upper bounds on strong USP size for $k \le 12$. Although our work only deals with puzzles of small-constant width, the strong USPs we find imply matrix multiplication algorithms that run in $O(n^\omega)$ time with exponent $\omega \le 2.66$. While our algorithms do not beat the fastest algorithms, our work provides evidence and, perhaps, a path to finding families of strong USPs that imply matrix multiplication algorithms that are more efficient than those currently known.

Deep neural networks (DNNs) are often used for text classification tasks as they usually achieve high levels of accuracy. However, DNNs can be computationally intensive with billions of parameters and large amounts of labeled data, which can make them expensive to use, to optimize and to transfer to out-of-distribution (OOD) cases in practice. In this paper, we propose a non-parametric alternative to DNNs that's easy, light-weight and universal in text classification: a combination of a simple compressor like gzip with a $k$-nearest-neighbor classifier. Without any training, pre-training or fine-tuning, our method achieves results that are competitive with non-pretrained deep learning methods on six in-distributed datasets. It even outperforms BERT on all five OOD datasets, including four low-resource languages. Our method also performs particularly well in few-shot settings where labeled data are too scarce for DNNs to achieve a satisfying accuracy.

Learning from Demonstration (LfD) is a powerful method for enabling robots to perform novel tasks as it is often more tractable for a non-roboticist end-user to demonstrate the desired skill and for the robot to efficiently learn from the associated data than for a human to engineer a reward function for the robot to learn the skill via reinforcement learning (RL). Safety issues arise in modern LfD techniques, e.g., Inverse Reinforcement Learning (IRL), just as they do for RL; yet, safe learning in LfD has received little attention. In the context of agile robots, safety is especially vital due to the possibility of robot-environment collision, robot-human collision, and damage to the robot. In this paper, we propose a safe IRL framework, CBFIRL, that leverages the Control Barrier Function (CBF) to enhance the safety of the IRL policy. The core idea of CBFIRL is to combine a loss function inspired by CBF requirements with the objective in an IRL method, both of which are jointly optimized via gradient descent. In the experiments, we show our framework performs safer compared to IRL methods without CBF, that is $\sim15\%$ and $\sim20\%$ improvement for two levels of difficulty of a 2D racecar domain and $\sim 50\%$ improvement for a 3D drone domain.

The 1$^{\text{st}}$ Workshop on Maritime Computer Vision (MaCVi) 2023 focused on maritime computer vision for Unmanned Aerial Vehicles (UAV) and Unmanned Surface Vehicle (USV), and organized several subchallenges in this domain: (i) UAV-based Maritime Object Detection, (ii) UAV-based Maritime Object Tracking, (iii) USV-based Maritime Obstacle Segmentation and (iv) USV-based Maritime Obstacle Detection. The subchallenges were based on the SeaDronesSee and MODS benchmarks. This report summarizes the main findings of the individual subchallenges and introduces a new benchmark, called SeaDronesSee Object Detection v2, which extends the previous benchmark by including more classes and footage. We provide statistical and qualitative analyses, and assess trends in the best-performing methodologies of over 130 submissions. The methods are summarized in the appendix. The datasets, evaluation code and the leaderboard are publicly available at https://seadronessee.cs.uni-tuebingen.de/macvi.

As large language models (LLMs) grow larger and more sophisticated, assessing their "reasoning" capabilities in natural language grows more challenging. Recent question answering (QA) benchmarks that attempt to assess reasoning are often limited by a narrow scope of covered situations and subject matters. We introduce WikiWhy, a QA dataset built around a novel auxiliary task: explaining why an answer is true in natural language. WikiWhy contains over 9,000 "why" question-answer-rationale triples, grounded on Wikipedia facts across a diverse set of topics. Each rationale is a set of supporting statements connecting the question to the answer. WikiWhy serves as a benchmark for the reasoning capabilities of LLMs because it demands rigorous explicit rationales for each answer to demonstrate the acquisition of implicit commonsense knowledge, which is unlikely to be easily memorized. GPT-3 baselines achieve only 38.7% human-evaluated correctness in the end-to-end answer & explain condition, leaving significant room for future improvements.

推荐系统，为用户提供个性化建议，为当今的许多社交媒体，电子商务和娱乐提供动力。但是，已知这些系统可以从各种角度从智力上隔离用户，或引起过滤气泡。在我们的工作中，我们表征和减轻了这种过滤器气泡效应。我们通过根据其用户 - 项目交互历史记录对各种数据点进行分类，并使用众所周知的Tracin方法对彼此的影响进行分类。最后，我们通过仔细地重新训练我们的建议系统来减轻这种过滤器气泡效果而不会损害精度。

在医学图像分析中需要进行几次学习的能力是对支持图像数据的有效利用，该数据被标记为对新类进行分类或细分新类，该任务否则需要更多的培训图像和专家注释。这项工作描述了一种完全3D原型的几种分段算法，因此，训练有素的网络可以有效地适应培训中缺乏的临床有趣结构，仅使用来自不同研究所的几个标记图像。首先，为了弥补机构在新型类别的情节适应中的广泛认识的空间变异性，新型的空间注册机制被整合到原型学习中，由分割头和空间对齐模块组成。其次，为了帮助训练观察到的不完美比对，提出了支持掩模调节模块，以进一步利用支持图像中可用的注释。使用589个骨盆T2加权MR图像的数据集分割了八个对介入计划的解剖结构的应用，该实验是针对介入八个机构的八个解剖结构的应用。结果证明了3D公式中的每种，空间登记和支持掩模条件的功效，所有这些条件都独立或集体地做出了积极的贡献。与先前提出的2D替代方案相比，不管支持数据来自相同还是不同的机构，都具有统计学意义的少量分割性能。

集中式培训（CT）是许多受欢迎的多代理增强学习（MARL）方法的基础，因为它允许代理商快速学习高性能的政策。但是，CT依靠代理人从对特定州对其他代理商的行为的一次性观察中学习。由于MARL代理商在培训期间探索和更新其政策，因此这些观察结果通常会为其他代理商的行为和预期的给定行动回报提供不良的预测。因此，CT方法患有较高的差异和容易出错的估计，从而损害了学习。除非施加了强大的分解限制，否则CT方法还遭受了复杂性爆炸性增长（例如，QMIX的单调奖励函数）。我们通过一个新的半居中的MAL框架来应对这些挑战，该框架执行政策安装的培训和分散的执行。我们的方法是嵌入式增强学习算法（PERLA），是参与者批评的MARL算法的增强工具，它利用了一种新型参数共享协议和策略嵌入方法来维持对其他代理商的行为的估计。我们的理论证明，佩拉大大降低了价值估计的差异。与各种CT方法不同，Perla无缝地采用MARL算法，它可以轻松地与代理数量缩放，而无需限制性分解假设。我们展示了Perla在基准环境中的出色经验表现和有效的缩放，包括Starcraft Micromagement II和Multi-Agent Mujoco

在这项工作中，我们考虑了成对的跨模式图像注册的任务，这可能会受益于仅利用培训时间可用的其他图像，而这些图像从与注册的图像不同。例如，我们专注于对准主体内的多参数磁共振（MPMR）图像，在T2加权（T2W）扫描和具有高B值（DWI $ _ {high-b} $）的T2加权（T2W）扫描和扩散加权扫描之间。为了在MPMR图像中应用局部性肿瘤，由于相应的功能的可用性，因此认为具有零B值（DWI $ _ {B = 0} $）的扩散扫描被认为更易于注册到T2W。我们使用仅训练成像模态DWI $ _ {b = 0} $从特权模式算法中提出了学习，以支持具有挑战性的多模式注册问题。我们根据356名前列腺癌患者的369组3D多参数MRI图像提出了实验结果图像对，与注册前7.96毫米相比。结果还表明，与经典的迭代算法和其他具有/没有其他方式的经典基于测试的基于学习的方法相比，提出的基于学习的注册网络具有可比或更高准确性的有效注册。这些比较的算法也未能在此具有挑战性的应用中产生DWI $ _ {High-B} $和T2W之间的任何明显改进的对齐。

人行道挑战的数据科学（DSPC）旨在通过提供一个基准的数据集和代码来加速自动化视觉系统，以进行路面状况监测和评估，以创新和开发机器学习算法，这些算法已准备就绪，可以准备好练习。行业使用。比赛的第一版吸引了来自8个国家的22支球队。要求参与者自动检测和分类从多个来源捕获的图像中存在的不同类型的路面遇险，并且在不同的条件下。竞争是以数据为中心的：通过利用各种数据修改方法（例如清洁，标签和增强），团队的任务是提高预定义模型体系结构的准确性。开发了一个实时的在线评估系统，以根据F1分数对团队进行排名。排行榜的结果显示了机器在路面监控和评估中提高自动化的希望和挑战。本文总结了前5个团队的解决方案。这些团队提出了数据清洁，注释，增强和检测参数调整领域的创新。排名最高的团队的F1得分约为0.9。本文以对当前挑战效果很好的不同实验的综述以及对模型准确性的任何显着提高的审查进行了综述。